Incremental constraint satisfaction for equational logic programming
نویسندگان
چکیده
منابع مشابه
Incremental Equational Constraint Analyses
Interpretation −→ Constraint Analyzer Abstract Conditional Narrowing e ∈ g ∧ u ∈ Ō(e) ∧ (λ → ρ ⇐ ẽ) << RA ∧ σ = mguA({(e|u)κ = λ}) 〈⇐ g, κ〉 ;A 〈⇐ (g ∼ {e}) ∪ {e[u ← ρ]} ∪ ẽ, κσ〉Conditional Narrowing e ∈ g ∧ u ∈ Ō(e) ∧ (λ → ρ ⇐ ẽ) << RA ∧ σ = mguA({(e|u)κ = λ}) 〈⇐ g, κ〉 ;A 〈⇐ (g ∼ {e}) ∪ {e[u ← ρ]} ∪ ẽ, κσ〉 where mguA is the abstract mgu RA is a simplified abstract program which always terminate...
متن کاملConstraint Satisfaction Using Constraint Logic Programming
Van Hentenryck, P., H. Simonis and M. Dincbas, Constraint satisfaction using constraint logic programming, Artificial Intelligence 58 (1992) 113-159. Constraint logic programming (CLP) is a new class of declarative programming languages whose primitive operations are based on constraints (e.g. constraint solving and constraint entailment). CLP languages naturally combine constraint propagation ...
متن کاملCategory-based Semantics for Equational and Constraint Logic Programming
This thesis proposes a general framework for equational logic programming, called catf:gory based equational logic by placing the general principles underlying the design of the pro gramming language Eqlog and formulated by Goguen and Meseguer into an abstract form. This framework generalises equational deduction to an arbitrary category satisfy ing certain natural conditions; completeness i...
متن کاملConstraint logic programming for qualitative and quantitative constraint satisfaction problems
AI and OR approaches have complementary strengths: AI in domain-specific knowledge representation and OR in efficient mathemat:ical computation. Constraint Logic Programming (CLP), which combines these complementary strengths of the AI and OR approach, is introduced as a new tool to formalize a special class of constraint satisfaction problems that include both qualitative and quantitative cons...
متن کاملA Category-Based Equational Logic Semantics to Constraint Programming
This paper exploits the point of view of constraint programming as computation in a logical system, namely constraint logic. We dene the basic ingredients of constraint logic, such as constraint models and generalised polynomials. We show that constraint logic is an institution , and we internalise the study of constraint logic to the framework of category-based equational logic. By showing tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00224-7